Something from Nothing Tom Davis [removed] http://www.geometer.org/mathcircles October 24, 2000

Source URL: www.geometer.org

• Axioms of set theory
• Z notation
• Function
• Zermelo–Fraenkel set theory
• Axiom schema of specification
• Constructible universe
• Axiom of choice
• Principia Mathematica
• Axiom of regularity
• Mathematical logic
• Mathematics
• Set theory

A Little Set Theory (Never Hurt Anybody) Matthew Saltzman Department of Mathematical Sciences Clemson University Draft: August 21, 2013

Source URL: www.math.clemson.edu

• EMC EA/EB
• Topological spaces
• Separation axioms
• Set theory
• Base
• Taiwanese Mandarin
• Topology
• General topology
• Rail transport

Reverse Mathematics Benedict Eastaugh December 13, 2011 In ordinary mathematical practice, mathematicians prove theorems, reasoning from a fixed1 set of axioms to a logically derivable conclusion. The axioms in play are

Source URL: extralogical.net

• Proof theory
• Model theory
• Z notation
• Formal systems
• Reverse mathematics
• Second-order arithmetic
• Peano axioms
• Zermelo–Fraenkel set theory
• Ordinal analysis
• Logic
• Mathematical logic
• Mathematics

Do the Integers Exist? The Unknowability of Arithmetic Consistency JACK T. SCHWARTZ Courant Institute It is an article of faith for most mathematicians that Peano’s axioms for arithmetic are consistent, perhaps becaus

Source URL: www.multimedialibrary.com

• Axiom
• Mathematical proof
• Foundations of mathematics
• Peano axioms
• Kurt Gödel
• Contradiction
• Zermelo–Fraenkel set theory
• Theorem
• Gottlob Frege
• Logic
• Mathematics
• Mathematical logic

Postdoctoral Position in the Philosophy of Set Theory The Hyperuniverse: Laboratory of the Infinite The KGRC (Kurt Goedel Research Center, University of Vienna) will serve as host for the Hyperuniverse Project, an invest

Source URL: www.logic.univie.ac.at

• Inner model theory
• Large cardinals
• Axioms of set theory
• Ordinal definable set
• Zermelo–Fraenkel set theory
• Von Neumann universe
• Absoluteness
• Reflection principle
• Core model
• Mathematical logic
• Set theory
• Mathematics

Functional Programming and Specification Lecture Note 5, 15 March 2011 Proving that a structure meets its specification The problem of verifying that a structure without substructures satisfies its specification is just

Source URL: homepages.inf.ed.ac.uk

• Z notation
• Constructible universe
• Axiom
• S
• Universal quantification
• Axioms of set theory
• Axiom schema of replacement
• First-order logic
• Mathematical logic
• Logic
• Mathematics

Axiomatic Set Theory: Problem sheet[removed]a) Assuming ZF (ie. ZF∗ +Foundation) prove that the following two definitions of “ordinal” are equivalent: (i) An ordinal is a transitive set well-ordered by ∈. (ii) An o

Source URL: people.maths.ox.ac.uk

• Ordinal numbers
• Axioms of set theory
• Z notation
• Constructible universe
• Ordinal arithmetic
• Axiom of regularity
• S
• Hartogs number
• Reflection principle
• Mathematical logic
• Mathematics
• Set theory

Axiomatic Set Theory: Problem sheet 1 1. Which of the ZF axioms (A1)–(A2), (A7) and (A8) hold in the structure hQ, Add to Reading List

Source URL: people.maths.ox.ac.uk

MATH CIRCLE - SET THEORY WEEK 3 SAM LICHTENSTEIN Today we reviewed the crisis we ran into last week, where a set R = {all x such that x is not in x} turned out to be contradictory. (Because R can be neither in R nor not

Source URL: www.themathcircle.org

• Zero
• Category of sets
• Set theory
• axioms of set theory
• Naive set theory
• Initial and terminal objects
• Mathematics
• Empty set
• Nothing

The Intensional Content of Rice’s Theorem (Pearl) Andrea Asperti Department of Computer Science, University of Bologna Mura Anteo Zamboni 7, 40127, Bologna, ITALY [removed]

Source URL: www.cs.unibo.it

• Mathematics
• Theory of computation
• Blum axioms
• Computable function
• ELEMENTARY
• Recursively enumerable set
• Smn theorem
• Computational complexity theory
• Lambda calculus
• Theoretical computer science
• Computability theory
• Applied mathematics